Irreducible trinomials over finite fields
نویسندگان
چکیده
منابع مشابه
Extremal Trinomials over Quadratic Finite Fields
In the process of pursuing a finite field analogue of Descartes’ Rule, Bi, Cheng, and Rojas (2014) proved an upper bound of 2 √ q − 1 on the number of roots of a trinomial c1 + c2x a2 + c3x a3 ∈ Fq [x], conditional on the exponents satisfying δ = gcd(a2, a3, q − 1) = 1, and Cheng, Gao, Rojas, and Wan (2015) showed that this bound is near-optimal for many cases. Our project set out to refine the...
متن کاملIrreducible Polynomials over Finite Fields
As we will see, modular arithmetic aids in testing the irreducibility of polynomials and even in completely factoring polynomials in Z[x]. If we expect a polynomial f(x) is irreducible, for example, it is not unreasonable to try to find a prime p such that f(x) is irreducible modulo p. If we can find such a prime p and p does not divide the leading coefficient of f(x), then f(x) is irreducible ...
متن کاملConstructing irreducible polynomials over finite fields
We describe a new method for constructing irreducible polynomials modulo a prime number p. The method mainly relies on Chebotarev’s density theorem.
متن کاملConstruction of Irreducible Polynomials over Finite Fields
In this paper we investigate some results on the construction of irreducible polynomials over finite fields. Basic results on finite fields are introduced and proved. Several theorems proving irreducibility of certain polynomials over finite fields are presented and proved. Two theorems on the construction of special sequences of irreducible polynomials over finite fields are investigated in de...
متن کاملGenerators and irreducible polynomials over finite fields
Weil’s character sum estimate is used to study the problem of constructing generators for the multiplicative group of a finite field. An application to the distribution of irreducible polynomials is given, which confirms an asymptotic version of a conjecture of Hansen-Mullen.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2003
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-03-01515-1